Sciweavers

372 search results - page 53 / 75
» On the Structural Complexity of Natural Language Sentences
Sort
View
VMCAI
2004
Springer
15 years 4 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
CIE
2005
Springer
15 years 4 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov
81
Voted
IUI
2010
ACM
15 years 8 months ago
Raconteur: from intent to stories
When editing a story from a large collection of media, such as photos and video clips captured from daily life, it is not always easy to understand how particular scenes fit into ...
Pei-Yu Chi, Henry Lieberman
CIKM
2008
Springer
15 years 1 months ago
Web-scale named entity recognition
Automatic recognition of named entities such as people, places, organizations, books, and movies across the entire web presents a number of challenges, both of scale and scope. Da...
Casey Whitelaw, Alexander Kehlenbeck, Nemanja Petr...
LREC
2010
175views Education» more  LREC 2010»
15 years 17 days ago
The Creation of a Large-Scale LFG-Based Gold Parsebank
Systems for syntactically parsing sentences have long been recognized as a priority in Natural Language Processing. Statistics-based systems require large amounts of high quality ...
Alexis Baird, Christopher R. Walker