Difference between revisions of "OpenIE Demo"
From Knowitall
Line 4: | Line 4: | ||
# Grouping for queries with multiple free query slots. Might conflict with previous item. | # Grouping for queries with multiple free query slots. Might conflict with previous item. | ||
# Classify negative and positive extractions. | # Classify negative and positive extractions. | ||
− | # Create a reduced index | + | # Create a reduced index by moving some filtering logic from the frontend to the index. |
# Creating an in-link ratio for removing over-linked entities. | # Creating an in-link ratio for removing over-linked entities. | ||
+ | # Adding resolver (or other) synonym database | ||
+ | # Creating a simple pipeline for adding new data to the demo (e.g. from current news text) | ||
= Small Projects = | = Small Projects = |
Revision as of 20:55, 4 June 2012
Contents
Large Projects
- Learning algorithm for search result order.
- Grouping for queries with multiple free query slots. Might conflict with previous item.
- Classify negative and positive extractions.
- Create a reduced index by moving some filtering logic from the frontend to the index.
- Creating an in-link ratio for removing over-linked entities.
- Adding resolver (or other) synonym database
- Creating a simple pipeline for adding new data to the demo (e.g. from current news text)
Small Projects
- Freebase autocompletion for types and entities, preferably not using old hacky method.
- Make popovers persistant.
- Progress bar on query.
- Better logic for filtering out near subset types.
- New icon.
Ideas
- Show all unique sentences if any sentence contains an extraction instance with confidences > threshold. Presently we don't show any sentences with extractions < threshold.
Goals
- Presentable on the smart phone
- Queries complete in less than 10 s