Issues - Revision history

imported>Martins at 14:55, 3 February 2014

2014-02-03T14:55:46Z

← Older revision		Revision as of 14:55, 3 February 2014
Line 74:		Line 74:
	== IAN and EUGENE (VERSION 1.2) ==		== IAN and EUGENE (VERSION 1.2) ==
	1. To include the option UNDO for the deletion of files and entries<br />		1. To include the option UNDO for the deletion of files and entries<br />
	2. Selecting a file should be the same as loading it<br />		2. Selecting a file should be the same as loading it (changed to: indicating clearly that a file has been loaded)<br />
	3. The range interval should be also user-defined. For the time being, it's only possible to select the interval from the drop-down list.<br />		3. <strike>The range interval should be also user-defined. For the time being, it's only possible to select the interval from the drop-down list.</strike><br />
	4. Users should have the possibility of uploading more than one file at once<br />		4. Users should have the possibility of uploading more than one file at once in a single .zip file<br />
	5. Users should have the possibility of visualizing the output of IAN as a graph<br />		5. Users should have the possibility of visualizing the output of IAN as a graph<br />
	6. Backtracking (top-down approach)<br />		6. Backtracking (top-down approach)<br />
	7. Stand-alone version of IAN and EUGENE<br />
			== IAN and EUGENE 2.0 ==
			1. SDK<br />
			2. Stand-alone version of IAN and EUGENE<br />

	== LILY (VERSION 1.1) ==		== LILY (VERSION 1.1) ==

imported>Martins at 18:53, 22 July 2013

2013-07-22T18:53:36Z

← Older revision		Revision as of 18:53, 22 July 2013
Line 28:		Line 28:
	:*<nowiki>(%x):=(%x/2); (</nowiki>i.e., divide % by 2)		:*<nowiki>(%x):=(%x/2); (</nowiki>i.e., divide % by 2)
	</strike>		</strike>
	;Indexation of relations		;Indexation of relations (postponed)
	:Relations should admit an index, as nodes. This would avoid ambiguity when dealing with relations in different scopes:		:Relations should admit an index, as nodes. This would avoid ambiguity when dealing with relations in different scopes:
	::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%a(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %a		::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%a(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %a
	::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%b(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %b		::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%b(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %b
	:In any case, the indexation should comply with a possible graph structure		:In any case, the indexation should comply with a possible graph structure
			<strike>
	;Discontinuous multiword expressions (706)		;Discontinuous multiword expressions (706)
	:Headwords, UWs and strings used as values of attributes:		:Headwords, UWs and strings used as values of attributes:
Line 43:		Line 44:
	:Rules with discontinuous nodes		:Rules with discontinuous nodes
	*(%x)(ANY SEQUENCE OF NODES, %z)(%y):=(%x)(%y)(%z);		*(%x)(ANY SEQUENCE OF NODES, %z)(%y):=(%x)(%y)(%z);
			</strike>

	===Front-end===		===Front-end===

imported>Martins at 18:52, 22 July 2013

2013-07-22T18:52:50Z

← Older revision		Revision as of 18:52, 22 July 2013
Line 45:		Line 45:

	===Front-end===		===Front-end===
			<strike>
	;Drag-and-drop		;Drag-and-drop
	:To include the possibility of using "drag-and-drop" to reorder dictionaries and dictionary entries, and grammars and grammar rules (in addition to the current one);		:To include the possibility of using "drag-and-drop" to reorder dictionaries and dictionary entries, and grammars and grammar rules (in addition to the current one);
			</strike>
	;Test sets		;Test sets
	:To improve the test sets. They should show only the differences. And the results should be exportable and importable.		:To improve the test sets. They should show only the differences. And the results should be exportable and importable.

imported>Martins at 19:27, 18 June 2013

2013-06-18T19:27:00Z

← Older revision		Revision as of 19:27, 18 June 2013
Line 51:		Line 51:
	;Trace		;Trace
	:The trace must be thoroughly revised. The desired structure is presented at [http://www.unlweb.net.br/forum/viewtopic.php?t=575]		:The trace must be thoroughly revised. The desired structure is presented at [http://www.unlweb.net.br/forum/viewtopic.php?t=575]
			<strike>
	;Groups		;Groups
	:Groups should be collapsible/expandable, and a single file may participate in several groups (grouping must be done using tags, instead of exclusive categories)		:Groups should be collapsible/expandable, and a single file may participate in several groups (grouping must be done using tags, instead of exclusive categories)
			</strike>
	;Shared resources		;Shared resources
	:Shared resources must bring the possibility of being reordered (currently, we cannot reorder them)		:Shared resources must bring the possibility of being reordered (currently, we cannot reorder them)

imported>Martins at 18:56, 18 June 2013

2013-06-18T18:56:42Z

← Older revision		Revision as of 18:56, 18 June 2013
Line 3:		Line 3:
	== IAN and EUGENE (VERSION 1.1) ==		== IAN and EUGENE (VERSION 1.1) ==
	=== Back-end ===		=== Back-end ===
	<strike>;Parsing		<strike>
			;Parsing
	: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:		: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)		:*(%a,A,B,C):=((%a,+E); (This rule is being accepted by the system)
Line 25:		Line 26:
	:*<nowiki>(%x):=(%x+1);</nowiki> (i.e., add 1 to %x)		:*<nowiki>(%x):=(%x+1);</nowiki> (i.e., add 1 to %x)
	:<nowiki>(%x):=(%x2);</nowiki> (i.e., multiply %x by 2)		:<nowiki>(%x):=(%x2);</nowiki> (i.e., multiply %x by 2)
	:*<nowiki>(%x):=(%x/2); (</nowiki>i.e., divide % by 2)</strike>		:*<nowiki>(%x):=(%x/2); (</nowiki>i.e., divide % by 2)
			</strike>
	;Indexation of relations		;Indexation of relations
	:Relations should admit an index, as nodes. This would avoid ambiguity when dealing with relations in different ~~scopest~~:		:Relations should admit an index, as nodes. This would avoid ambiguity when dealing with relations in different scopes:
	::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%a(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %a		::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%a(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %a
	::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%b(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %b		::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%b(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a scope inside %b
Line 57:		Line 59:
	;IAN/EUGENE communication		;IAN/EUGENE communication
	:A given output of IAN could be used as the input for EUGENE and vice-versa - using the loaded resources		:A given output of IAN could be used as the input for EUGENE and vice-versa - using the loaded resources
			<strike>
	;Update		;Update
	:Dictionary and grammar update should replace the current files instead of adding the resources to the end of the existing files		:Dictionary and grammar update should replace the current files instead of adding the resources to the end of the existing files
	;Range		;Range
	:The trace level of the option "range" should be defined by user. It's OK to use NONE as default, but the user could also have more detailed results for more than one sentence.		:The trace level of the option "range" should be defined by user. It's OK to use NONE as default, but the user could also have more detailed results for more than one sentence.
			</strike>

	== IAN and EUGENE (VERSION 1.2) ==		== IAN and EUGENE (VERSION 1.2) ==

imported>Martins at 18:55, 18 June 2013

2013-06-18T18:55:25Z

← Older revision		Revision as of 18:55, 18 June 2013
Line 3:		Line 3:
	== IAN and EUGENE (VERSION 1.1) ==		== IAN and EUGENE (VERSION 1.1) ==
	=== Back-end ===		=== Back-end ===
	;Parsing		<strike>;Parsing
	: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:		: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)		:*(%a,A,B,C):=((%a,+E); (This rule is being accepted by the system)
Line 25:		Line 25:
	:*<nowiki>(%x):=(%x+1);</nowiki> (i.e., add 1 to %x)		:*<nowiki>(%x):=(%x+1);</nowiki> (i.e., add 1 to %x)
	:<nowiki>(%x):=(%x2);</nowiki> (i.e., multiply %x by 2)		:<nowiki>(%x):=(%x2);</nowiki> (i.e., multiply %x by 2)
	:*<nowiki>(%x):=(%x/2); (</nowiki>i.e., divide % by 2)		:*<nowiki>(%x):=(%x/2); (</nowiki>i.e., divide % by 2)</strike>
	;Indexation of relations		;Indexation of relations
	:Relations should admit an index, as nodes. This would avoid ambiguity when dealing with relations in different scopest:		:Relations should admit an index, as nodes. This would avoid ambiguity when dealing with relations in different scopest:
Line 61:		Line 61:
	;Range		;Range
	:The trace level of the option "range" should be defined by user. It's OK to use NONE as default, but the user could also have more detailed results for more than one sentence.		:The trace level of the option "range" should be defined by user. It's OK to use NONE as default, but the user could also have more detailed results for more than one sentence.

	== IAN and EUGENE (VERSION 1.2) ==		== IAN and EUGENE (VERSION 1.2) ==
	1. To include the option UNDO for the deletion of files and entries<br />		1. To include the option UNDO for the deletion of files and entries<br />

imported>Martins at 10:41, 20 March 2013

2013-03-20T10:41:59Z

← Older revision		Revision as of 10:41, 20 March 2013
Line 84:		Line 84:

	== UNL Tool Kit (VERSION BETA) ==		== UNL Tool Kit (VERSION BETA) ==
	1. Corpus processing: given a set of documents, the system should clean it (from html tags, for instance), segment it (according to the a user-defined set of symbols), tokenize it (according to the dictionary), extract the word list (with frequency of occurrence), lemmatize it (according to the dictionary), POS tag it (according to the dictionary) and extract the POS patterns (with the frequency of occurrence).<br />		1. Corpus processing: given a set of documents, the system should clean it (from html tags, for instance), segment it (according to the a user-defined set of symbols), tokenize it (according to the dictionary), extract the word list (with frequency of occurrence), lemmatize it (according to the dictionary), POS tag it (according to the dictionary) and extract the POS patterns (with the frequency of occurrence). The system should also include search facilities (concordance).<br />
	2. Dictionary builder: given a word list, the system should lemmatize it (according to the dictionary) and POS tag it.<br />		2. Dictionary builder: given a word list, the system should lemmatize it (according to the dictionary) and POS tag it.<br />
	3. Grammar builder: given a set of POS tagged sentences, the system should build the corresponding trees in order to form a tree-bank (by hand, i.e., through a tree-builder user-friendly interface, or automatically, using a grammar provided according to the Grammar Specs). The tree-bank will be used to induce a grammar (reverse engineering).<br />		3. Grammar builder: given a set of POS tagged sentences, the system should build the corresponding trees in order to form a tree-bank (by hand, i.e., through a tree-builder user-friendly interface, or automatically, using a grammar provided according to the Grammar Specs). The tree-bank will be used to induce a grammar (reverse engineering).<br />
	4. Graph builder: given a set of trees, the system should build the corresponding graphs in order to form a graph-bank (by hand, i.e., through a graph-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs). The graph-bank will be used to induce a grammar (reverse engineering).<br />		4. Graph builder: given a set of trees, the system should build the corresponding graphs in order to form a graph-bank (by hand, i.e., through a graph-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs). The graph-bank will be used to induce a grammar (reverse engineering).<br />

imported>Martins at 10:19, 20 March 2013

2013-03-20T10:19:47Z

← Older revision		Revision as of 10:19, 20 March 2013
Line 79:		Line 79:
	1. Graphic output (as fancy as possible and with support for touch screen).<br />		1. Graphic output (as fancy as possible and with support for touch screen).<br />
	2. Localizable interface.<br />		2. Localizable interface.<br />
			3. Another design for the interface (cleaner and simpler).<br />
	3. Mobile (app) version.<br />		3. Mobile (app) version.<br />
	4. Integration with EUGENE.<br />		4. Integration with EUGENE.<br />

imported>Martins at 08:47, 20 March 2013

2013-03-20T08:47:29Z

← Older revision		Revision as of 08:47, 20 March 2013
Line 85:		Line 85:
	1. Corpus processing: given a set of documents, the system should clean it (from html tags, for instance), segment it (according to the a user-defined set of symbols), tokenize it (according to the dictionary), extract the word list (with frequency of occurrence), lemmatize it (according to the dictionary), POS tag it (according to the dictionary) and extract the POS patterns (with the frequency of occurrence).<br />		1. Corpus processing: given a set of documents, the system should clean it (from html tags, for instance), segment it (according to the a user-defined set of symbols), tokenize it (according to the dictionary), extract the word list (with frequency of occurrence), lemmatize it (according to the dictionary), POS tag it (according to the dictionary) and extract the POS patterns (with the frequency of occurrence).<br />
	2. Dictionary builder: given a word list, the system should lemmatize it (according to the dictionary) and POS tag it.<br />		2. Dictionary builder: given a word list, the system should lemmatize it (according to the dictionary) and POS tag it.<br />
	3. Grammar builder: given a set of POS tagged sentences, the system should build the corresponding trees in order to form a tree-bank (by hand, i.e., through a tree-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs)<br />		3. Grammar builder: given a set of POS tagged sentences, the system should build the corresponding trees in order to form a tree-bank (by hand, i.e., through a tree-builder user-friendly interface, or automatically, using a grammar provided according to the Grammar Specs). The tree-bank will be used to induce a grammar (reverse engineering).<br />
	4. Graph builder: given a set of trees, the system should build the corresponding graphs in order to form a graph-bank (by hand, i.e., through a graph-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs)<br />		4. Graph builder: given a set of trees, the system should build the corresponding graphs in order to form a graph-bank (by hand, i.e., through a graph-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs). The graph-bank will be used to induce a grammar (reverse engineering).<br />

imported>Martins at 08:44, 20 March 2013

2013-03-20T08:44:54Z

← Older revision		Revision as of 08:44, 20 March 2013
Line 86:		Line 86:
	2. Dictionary builder: given a word list, the system should lemmatize it (according to the dictionary) and POS tag it.<br />		2. Dictionary builder: given a word list, the system should lemmatize it (according to the dictionary) and POS tag it.<br />
	3. Grammar builder: given a set of POS tagged sentences, the system should build the corresponding trees in order to form a tree-bank (by hand, i.e., through a tree-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs)<br />		3. Grammar builder: given a set of POS tagged sentences, the system should build the corresponding trees in order to form a tree-bank (by hand, i.e., through a tree-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs)<br />
	4. ~~Semantic interpretation module~~: given a set of trees, the system should build the corresponding graphs in order to form a graph-bank (by hand, i.e., through a graph-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs)<br />		4. Graph builder: given a set of trees, the system should build the corresponding graphs in order to form a graph-bank (by hand, i.e., through a graph-builder user-friendly interface) or automatically (using a grammar provided according to the Grammar Specs)<br />