Presentation is loading. Please wait.

Presentation is loading. Please wait.

Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise

Similar presentations


Presentation on theme: "Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise"— Presentation transcript:

1 Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise
NoteSearch Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise Good morning, we are group B, here to present to you our concept of a note searching application which we are tentatively calling “NoteSearch”. The motivation behind this application is this:

2 Do your notes look like this?
Maybe you have a large amount of notes, or maybe your notes are scattered all over your hard drive. Either way, if it’s too much of a pain to search through note by note for a key piece of information, we are here to offer a solution.

3 Basic Requirements Be able to search notes for:
Phone Number URL address Keyword Specify which files to search from Display Results Access file from results page Requirements = functionality

4 A preliminary overview
The User Interface A preliminary overview There are both issues, that we need to discuss and work on, and certain risks, that we need to take into account.

5 Here is the user interface.

6 First requirement of searching for specific data types

7 Second requirement of searching within a specific file.

8 Optional search criteria of date [EXAMPLE OF MIDTERM DATE]

9 Search string: all or part of the desired string.

10 3rd requirement of displaying results [EXAMPLE OF SEARCH AREA]
4th requirement being that the results link to the file. [EXAMPLE OF SEARCHING NOTES FOR HEADING, WANTING TO STUDY PARTICULAR MATERIAL FOR MIDTERM]

11 Another feature we think could be very helpful: if there is a string which is not recognized by the recognizer, such as a name, there is a field where the user can write in the search string and search in that manner.

12 This way, the recognizer will hopefully recognize both written strings in the same way and match them together. Now I will turn it over to Hanna for more discussion of our requirements as well as possible issues and risks associated with the project.

13 Requirements Basic Secondary
There are both issues, that we need to discuss and work on, and certain risks, that we need to take into account.

14 Secondary requirements
Order Results Display information about results Display snapshots of results Highlight matched words Search for other data types Specify date range of files Include exact position of resulting find Other Extensions?

15 Identified issues to solve Potential risks to limit
Issues and risks Identified issues to solve Potential risks to limit There are both issues, that we need to discuss and work on, and certain risks, that we need to take into account.

16 Identified issues Recognizing search string Recognizing notes
Evaluation of matches Displaying the matches These are the major issues that we intend to deal with right away. Our software must of course recognize both the search string and the search base (notes) correctly. Then we need to display the good matches.

17 Identified issues Recognizing search string What should match doesn’t
What shouldn’t match does Several forms of input Let the recognizer also interpret the user’s input for the search string There are things that will have been wrongly transformed in the notes and if we search for the original text we might not find it. Names of persons or places that are not in the dictionary could be such an example. An initial idea to work around this is to let the user have several forms of input. By letting the user handwrite his search string, we can hope that the recognizer interpret this as the same as the requested note string.

18 Identified issues Recognizing notes Use the provided recognizer
Other people have spent enormous resources on this subject, therefore our software will benefit from using existing software.

19 Identified issues Evaluation of matches What makes a good match?
When is one match better than another? How to grade the matches? Percentage exact match Look at surroundings for likelihood The software must be able to evaluate the results. Only displaying exact matches isn’t so great, but neither is displaying too many! So, our software need to grade the matches and display them in this order. We could look at both how exact the strings match each other, but also take the surroundings into account.

20 Identified issues Displaying the matches Screen shot of actual note
Clip size Screen size Information about match The actual display of the results is also important. We want to have a visual display of the matches, i.e. a screen shot. There are several issues there to think about to make the screen shot useful for the user, such as clip size and the original notes’ size. There should also be some textual information about the results.

21 Potential risks Depend on existing resources
Different users take different notes There is a resource limit

22 Potential risks Depend on existing resources
We intend to use the existing recognizer Can we trust it to do well? What can it do? What does it do best?

23 Potential risks Different users take different notes
Must work for several styles of notes Must work for previously unseen notes

24 Potential risks There is a resource limit Time Knowledge
Abilities of existing software

25 Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise
NoteSearch Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise Good morning, we are group B, here to present to you our concept of a note searching application which we are tentatively calling “NoteSearch”. The motivation behind this application is this:


Download ppt "Hanna Filipsson Nathan Fong Brian Watanabe Taryn Wise"

Similar presentations


Ads by Google