Combining Finite State Automata and a Greedy Learning Algorithm to Determine the Syntactic Roles of Commas

Authors:
Sebastian van Delden;Fernando Gomez
Affiliations:
-;-
Venue:
ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Year:
2002

Citing 0
Cited 3

A shallow parser based on closed-class words to capture relations in biomedical text

Journal of Biomedical Informatics
Retrieving NASA problem reports: a case study in natural language information retrieval

Data & Knowledge Engineering - NLDB2002
Using machine learning techniques to build a comma checker for Basque

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.