Semantic parsing natural language into SPARQL: an LSTM enconder-decoder neural net approach (2017)
- Authors:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- Assunto: WEB SEMÂNTICA
- Language: Inglês
- Imprenta:
- Publisher: SBC
- Publisher place: Porto Alegre
- Date published: 2017
- Source:
- Título do periódico: Anais
- Conference titles: Encontro Nacional de Inteligência Artificial e Computacional - ENIAC
-
ABNT
LUZ, Fabiano Ferreira e FINGER, Marcelo. Semantic parsing natural language into SPARQL: an LSTM enconder-decoder neural net approach. 2017, Anais.. Porto Alegre: SBC, 2017. Disponível em: https://repositorio.usp.br/directbitstream/e1f74894-31a2-4a13-a2cd-d78f4024cf84/2875829.pdf. Acesso em: 23 abr. 2024. -
APA
Luz, F. F., & Finger, M. (2017). Semantic parsing natural language into SPARQL: an LSTM enconder-decoder neural net approach. In Anais. Porto Alegre: SBC. Recuperado de https://repositorio.usp.br/directbitstream/e1f74894-31a2-4a13-a2cd-d78f4024cf84/2875829.pdf -
NLM
Luz FF, Finger M. Semantic parsing natural language into SPARQL: an LSTM enconder-decoder neural net approach [Internet]. Anais. 2017 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/e1f74894-31a2-4a13-a2cd-d78f4024cf84/2875829.pdf -
Vancouver
Luz FF, Finger M. Semantic parsing natural language into SPARQL: an LSTM enconder-decoder neural net approach [Internet]. Anais. 2017 ;[citado 2024 abr. 23 ] Available from: https://repositorio.usp.br/directbitstream/e1f74894-31a2-4a13-a2cd-d78f4024cf84/2875829.pdf - Técnicas de otimização da precisão empregadas no etiquetador Tycho Brahe
- Concurrency control for perceivedly instantaneous transactions in valid-time databases
- Resource use pattern analysis for predicting resource availability in opportunistic grids
- Completeness for cut-based abduction
- On the predictability of classical propositional logic
- Automated classification of pathology reports
- Minimal axiomatizations and algebraic rings: a conjectured relationship
- Towards an efficient prover for the C1 paraconsistent logic
- Computational solutions for structural constraints: learning structural permissions in categorial grammar
- Towards polynomial approximations of full propositional logic
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2875829.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
