Title

Combining Finite State Automata And A Greedy Learning Algorithm To Determine The Syntactic Roles Of Commas

Abstract

A method has been developed and implemented that assigns syntactic roles to commas. 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.

Publication Date

12-1-2002

Publication Title

Proceedings of the International Conference on Tools with Artificial Intelligence

Number of Pages

293-300

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0036929761 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0036929761

This document is currently not available here.

Share

COinS