Sciweavers

17 search results - page 2 / 4
» Compiling and Using Finite-State Syntactic Rules
Sort
View
COLING
1992
13 years 6 months ago
A Logic Programming View of Relational Morphology
he more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of Koskenniemi's work which ha...
Harvey Abramson
COLING
1996
13 years 6 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
EACL
2003
ACL Anthology
13 years 6 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
CICLING
2005
Springer
13 years 11 months ago
Design and Development of a System for the Detection of Agreement Errors in Basque
This paper presents the design and development of a system for the detection and correction of syntactic errors in free texts. The system is composed of three main modules: a) a ro...
Arantza Díaz de Ilarraza Sánchez, Ko...
AAAI
1992
13 years 6 months ago
Learning to Disambiguate Relative Pronouns
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
Claire Cardie