Issues

From UNL Wiki
(Difference between revisions)
Jump to: navigation, search
(Back-end)
Line 10: Line 10:
 
;Consistency of graphs (1.1)
 
;Consistency of graphs (1.1)
 
:Rules leading to impossible graphs are working. The example below is generating an impossible graph.
 
:Rules leading to impossible graphs are working. The example below is generating an impossible graph.
:''The rule
+
:(NB(N,%n;JB(%j;%j2),{and|or},%adjc),%m):= (JB(%j;%j2),rel=%adjc) (NB(N,%n;%j),rel=%m)(NB(N,%n;%j2),rel=%m);
(NB(N,%n;JB(%j;%j2),{and|or},%adjc),%m):= (JB(%j;%j2),rel=%adjc) (NB(N,%n;%j),rel=%m)(NB(N,%n;%j2),rel=%m);
+
:This rule is putting the same node %j in two different positions in the node list. This should not be possible. A node cannot be inside two different nodes in a list structure.''
:And it's putting the same node %j in two different positions in the node list. This should not be possible. A node cannot be inside two different nodes in a list structure.''
+
 
;Preprocessing module (1.1)
 
;Preprocessing module (1.1)
 
:A module for preprocessing is needed in IAN. It will serve for sentence segmentation and morphological preprocessing. Rules of the preprocessing module will be only of the LL type, will only deal with strings and will apply before any dictionary search. They will be used to assign STAIL and SHEAD. Regular expressions should be admitted. The unit of processing will be the paragraph (i.e., any string between \n and \r). Examples of possible rules:
 
:A module for preprocessing is needed in IAN. It will serve for sentence segmentation and morphological preprocessing. Rules of the preprocessing module will be only of the LL type, will only deal with strings and will apply before any dictionary search. They will be used to assign STAIL and SHEAD. Regular expressions should be admitted. The unit of processing will be the paragraph (i.e., any string between \n and \r). Examples of possible rules:

Revision as of 09:01, 17 October 2012

List of pending features and known bugs.

Contents

IAN and EUGENE

Back-end

Parsing (1.0)
Parsing of rules need to be improved. IAN and EUGENE were accepting rules with unbalanced parentheses. There is also a problem of an extra comma in the rules. The sensitivity of syntactic check of the Engines should be higher. Eugene and IAN must be sensitive to the following syntactic error:
  • (%a,A,B,C):=((%a,+E); (This rule is being accepted by the system)
Encoding (1.0)
Eugene and IAN should reject wrong UTF-8 encoding. From the perspective of the user, the rule was perfect, and the string was clearly and correctly displayed; but the machine was replacing it by empty.
Consistency of graphs (1.1)
Rules leading to impossible graphs are working. The example below is generating an impossible graph.
(NB(N,%n;JB(%j;%j2),{and|or},%adjc),%m):= (JB(%j;%j2),rel=%adjc) (NB(N,%n;%j),rel=%m)(NB(N,%n;%j2),rel=%m);
This rule is putting the same node %j in two different positions in the node list. This should not be possible. A node cannot be inside two different nodes in a list structure.
Preprocessing module (1.1)
A module for preprocessing is needed in IAN. It will serve for sentence segmentation and morphological preprocessing. Rules of the preprocessing module will be only of the LL type, will only deal with strings and will apply before any dictionary search. They will be used to assign STAIL and SHEAD. Regular expressions should be admitted. The unit of processing will be the paragraph (i.e., any string between \n and \r). Examples of possible rules:
  • (" .",%x):=(%x)(+STAIL,%y);
  • (".",%x)(/[ABCDEFGHIJKLMNOPQRSTUVWXYZ]/,%y):=(%z,+SHEAD)(%x)(%y);
  • ("an ",%x)(/[aeiouy]/,%y):=("a ",%x)(%y);
Observations:
  • +STAIL automatically creates SHEAD (in addition to STAIL itself), and +SHEAD automatically create STAIL.
  • The preprocessing module should be provided in a separate tab (S-Rules, for segmentation rules)
Mathematical operations (1.1) (574)
Mathematical operations inside nodes
  • (%x):=(%x-1); (i.e., reduce the value of %x in 1)
  • (%x):=(%x+1); (i.e., add 1 to %x)
  • (%x):=(%x*2); (i.e., multiply %x by 2)
  • (%x):=(%x/2); (i.e., divide % by 2)

Front-end

(1.1) To include the possibility of using "drag-and-drop" to reorder dictionary entries and grammar rules (in addition to the current one);

6. (1.0) To create the possibility of having "test sets". The user should have the possibility of flagging a given sentence as correct (i.e., the grammar and dictionary would work for it). After that, the sentence would be automatically included in a "test set", to be defined by the user, and stored as a reference. The user would have the possibility of checking the consistency of the grammar and dictionary at any time by running this test set (but without the need to analyze the individual outputs for the sentences, because the machine would do that automatically, and would highlight all the sentences for which the results would be different than the ones defined as correct).

7. (1.0) The loaded unl sentence issue after logout/loging with different user. Sometimes a wrong unl document/sentence is loaded, when a user is changed within the same session.

8. (1.0) In the dictionary and rule editor. The checkbox at the left should be used to select entries or rules, and the operations (edit, delete, clone, disable/enable) should appear as individual options right after them (and not at the rightmost position in the line), or as multi-entry options at the end of the page. It is recomended to use the same approach and icons used, for instance, in other DBMS such as phpMyAdmin, SQLyog, OracleSQL and others. The thread [1] brings a screenshot of what to be the ideal interface for the editor.

11. (1.1) The trace must be revised to be more intuitive.

12. (1.0) The disambiguation rules should be enabled/disabled in one single place, instead of two. Now they can be turned on/off both in the EUGENE/IAN tabs by a checkbox and loaded/unloaded from the editor.

13. (1.0) The "create" button is confusing. Users are cloning rules instead of saving them. The same for the check box at the left of dictionary and grammar entries. People are using them to select rules for edition rather than for deletion.

14. (1.0) After cloning a rule or dictionary entry, the system goes back to page 1 (instead of remaining in the same page).

15. (1.0) It’s not possible to delete shared dictionaries (although it’s possible to delete shared rule-sets)

16. (1.0) People have been pressing the button “delete dictionary” instead of “delete selected entries”. We do need to put the buttons for files and entries in different places.

17. (1.0) To include a link to EUGENE in IAN's welcome tab, and link to IAN in EUGENE's welcome tab.

574. (1.0) To create the possibility to add more than one dictionary entry or more than one grammar rule at the same time;

LILY

End-user interface

  1. (BETA)To remove the option "compiled resources" from the interface. There will be an admin page where the configuration will be set.
  2. (BETA) LILY is not accepting Arabic input.
  3. (BETA)To replace the localization file (translations to be provided by the UNDL Foundation)
  4. (BETA)To replace the logos of the UNDLF and UNL by others with higher-resolution (to be provided by the UNDL Foundation)
  5. (BETA)To replace the copyright (to be provided by the UNDL Foundation)
  6. (BETA)To remove the login in the end-user final version
  7. (BETA)To replace the contact to info@undlfoundation.org
  8. (BETA) Background images are not being aligned in zoom in and zoom out (CSS). The application is not working in IE.
  9. (BETA)To reduce the size of the logos
  10. (BETA)To synchronize users and passwords with the UNLweb
  11. (1.0)Feedback from users (source, UNL and target must be stored with the corresponding evaluation)

Test interface

  1. To have IAN's and EUGENE's dictionary, t-rules and d-rules tab in the same interface inside the UNLdev.

NORMA

SEAN

Software