1235 search results - page 144 / 247 » Structured Meanings in Computational Linguistics |
NDJFL
1998
14 years 9 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
100
click to vote
IUI
2005
ACM
15 years 3 months ago
2005
ACM
Every program tells a story. Programming, then, is the art of constructing a story about the objects in the program and what they do in various situations. So-called programming l...
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
CP
1997
Springer
15 years 2 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...