Finite state methods in natural language processing.
- Published in:
- Natural Language Engineering, 2003, v. 9, n. 1, p. 1, doi. 10.1017/S1351324903003139
- By:
- Publication type:
- Article
Works matching IS 13513249 AND DT 2003 AND VI 9 AND IP 1
Results: 6
1
2
Recursion by optimization: on the complexity of bidirectional optimality theory.
- Published in:
- Natural Language Engineering, 2003, v. 9, n. 1, p. 21, doi. 10.1017/S1351324903003115
- By:
- Publication type:
- Article
3
Logical specification of regular relations for NLP.
- Published in:
- Natural Language Engineering, 2003, v. 9, n. 1, p. 65, doi. 10.1017/S1351324903003103
- By:
- Publication type:
- Article
4
Application of finite-state transducers to the acquisition of verb subcategorization information.
- Published in:
- Natural Language Engineering, 2003, v. 9, n. 1, p. 39, doi. 10.1017/S1351324903003097
- By:
- Publication type:
- Article
5
Lenient morphological analysis.
- Published in:
- Natural Language Engineering, 2003, v. 9, n. 1, p. 87, doi. 10.1017/S1351324903003085
- By:
- Publication type:
- Article
6
Finite state methods for hyphenation.
- Published in:
- Natural Language Engineering, 2003, v. 9, n. 1, p. 5, doi. 10.1017/S1351324903003073
- By:
- Publication type:
- Article