id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_i6l4k3m3zba3nlvdwx2wumw2fe	Siva Reddy	Large-scale Semantic Parsing without Question-Answer Pairs	2014	16	.pdf	application/pdf	9397	1232	65	parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs. The parser's graphs (also called ungrounded graphs) are mapped to all possible Freebase subgraphs (also called grounded graphs) by replacing edges and nodes with relations and types in Figure 2: Steps involved in converting a natural language sentence to a Freebase grounded graph. Our contributions include: a novel graph-based method to convert natural language sentences to grounded semantic parses which exploits the similarities in the topology of knowledge graphs and linguistic structure, together with the ability to train using a wide range represented by rectangles, relations between entities by edges, mediator nodes by circles, types by to construct ungrounded graphs topologically similar to Freebase, we define five types of nodes: We ground semantic graphs in Freebase by mapping two-stage procedure: first, a natural language sentence is converted to a domain-independent semantic parse and then grounded onto Freebase using a	./cache/work_i6l4k3m3zba3nlvdwx2wumw2fe.pdf	./txt/work_i6l4k3m3zba3nlvdwx2wumw2fe.txt