GRAPH MATCHING: Related Papers in ACL Anthology

GRAPH MATCHING can be found in the following ACL ARC 1.0 documents (click to explore):

• (ACL ID: C96-1013) concept clustering and knowledge integration from a children's dictionary
• (ACL ID: C96-1089) learning bilingual collocations by word-level sorting
• (ACL ID: H05-1049) robust textual inference via graph matching
• (ACL ID: N06-1006) learning to recognize features of valid textual entailments
• (ACL ID: P04-1001) optimization in multimodal interpretation
• (ACL ID: P06-1081) concept unification of terms in different languages for ir
• (ACL ID: P89-1026) two constraints on speech act ambiguity
• (ACL ID: P90-1029) multiple underlying systems
• (ACL ID: P93-1015) parsing free word order languages in the paninian framework
• (ACL ID: P98-1016) redundancy
• (ACL ID: P99-1071) information fusion in the context of multi-document summarization
• (ACL ID: W00-0403) centroid-based summarization of multiple documents
• (ACL ID: W00-0404) extracting key paragraph based on topic and event detection towards multi-document summarization
• (ACL ID: W02-0310) analyzing the semantics of patient data to rank records of literature retrieval
• (ACL ID: W03-0701) combining semantic and temporal constraints for multimodal integration in conversation systems
• (ACL ID: W03-0906) entailment, intensionality and text understanding
• (ACL ID: W05-1613) natural language directed inference in the presentation of ontologies
• (ACL ID: W06-0707) duc 2005
• (ACL ID: W06-3805) a study of two graph algorithms in topic-driven summarization
• (ACL ID: W06-3806) similarity between pairs of co-indexed trees for textual entailment recognition
• (ACL ID: W06-3813) matching syntactic-semantic graphs for semantic relation assignment
• (ACL ID: W94-0101) invited talk
• (ACL ID: X93-1010) dr-link system