loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'02)
Combining Finite State Automata and a Greedy Learning Algorithm to Determine the Syntactic Roles of Commas
Washington, DC
November 04-November 06
ISBN: 0-7695-1849-4
Sebastian van Delden, University of Central Florida
Fernando Gomez, University of Central Florida
A method has been developed and implemented that assigns syntactic roles to commas1 . Text that has been tagged using a part-of-speech tagger serves as the input to the system. A set of Finite State Automata first assigns temporary syntactic roles to each comma in the sentence. A greedy learning algorithm is then used to determine the final syntactic roles of the commas. The system requires no training and is not domain specific. The performance of the system on numerous corpora is given.
Citation:
Sebastian van Delden, Fernando Gomez, "Combining Finite State Automata and a Greedy Learning Algorithm to Determine the Syntactic Roles of Commas," ictai, pp.293, 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.