Electronic television program guides typically allow the viewer to display information about particular television shows, such as the names of the actors and directors involved in the television shows, as well as their roles. What the viewer may not realize is that the process of collecting this information can be extremely inefficient; it can be time-consuming and expensive. Moreover, much of the process typically requires a considerable amount of human involvement to ensure that the information is relatively accurate.
One reason that the information collection process is so inefficient is that the information often contains inaccuracies, and may exclude certain information altogether. Examples of well-known sources of such information include Internet Movie Database (IMDB) (www.imdb.com), All Movie Guide (AMG) (www.allmovie.com), and Tribune Media Services (TMS).
What is needed is a way to collect and merge information, such as television show information, from multiple sources, while maintaining a reasonable degree of accuracy.
Aspects as described herein are directed to merging data from two or more sources to produce a merged set of data. For instance, in the context of television show information, references to the same person may be matched between sources where the person is indicated as having the same relationship with a television show (e.g., indicated as being an actor in a particular television show). Then, the most reliable biographical information may be chosen from amongst the sources, and associated with the person. In some cases, the matching process may produce ambiguous results, which may trigger special handling. By merging two or more of source data sets together, the merged data set may potentially be more complete, and contain fewer inaccuracies, than any one of the source data sets taken individually.
Further aspects are directed to comparing a first data set with a second data set, the first data set associating a first plurality of names with a first plurality of roles, and the second data set associating a second plurality of names with a second plurality of roles; and generating a third data set based on an outcome of the comparing, such that the third data set associates a subset of the first plurality of names with a subset of the second plurality of roles.
Still further aspects are directed to receiving a first data set representing relationships between a first plurality of names with a first plurality of events, and associating the first plurality of names with a plurality of first identifiers; receiving a second data set representing relationships between a second plurality of names with a second plurality of events, and associating the second plurality of names with a plurality of second identifiers; for each of the plurality of first identifiers, associating a third identifier with the first identifier; determining a subset of the relationships of the second data set that each corresponds to at least one of the relationships of the first data set; for each of the subset of relationships of the second data set, associating the second identifier of the name that is part of that relationship of the second data set with the third identifier of the name in the at least one corresponding relationship of the first data set; and generating a third data set representing the associations between the first and third identifiers and the associations between the second and third identifiers.
Yet further aspects are directed to receiving a first data set representing relationships between a first plurality of names with a first plurality of events, associating the first plurality of names with a plurality of first identifiers; receiving a second data set representing relationships between a second plurality of names with a second plurality of events; and for each of at least some of the relationships of the second data set, performing only one of the following depending upon the relationships of the first data set: associating the relationship of the second data set with one of the first identifiers, or associating the relationship of the second data set with a second identifier. In addition, a third data set may be generated representing the associations between the relationships of the second data set with the first and second identifiers.
These and other aspects of the disclosure will be apparent upon consideration of the following detailed description.
A more complete understanding of the present disclosure and the potential advantages of various aspects described herein may be acquired by referring to the following description in consideration of the accompanying drawings, in which like reference numbers indicate like features, and wherein:
A “computer” as referred to herein (such as computer 101) broadly includes any electronic, electro-optical, and/or mechanical device, or system of physically separate such devices, that is able to process and manipulate information, such as in the form of data. Non-limiting examples of a computer include one or more personal computers (e.g., desktop or laptop), servers, personal digital assistants (PDAs), and/or a system of these in any combination or subcombination. In addition, a given computer may be physically located completely in one location or may be distributed amongst a plurality of locations (i.e., may implement distributive computing).
A computer typically includes hardware that may execute software and/or be configured in hardware to perform specific functions. The software may be stored on a computer-readable medium in the form of computer-readable instructions. A computer may read those computer-readable instructions, and in response perform various steps as defined by those computer-readable instructions. Thus, any functions attributed to a computer as described herein may be implemented by the computer, such as by reading and executing such computer-readable instructions, and/or by any hardware subsystem (e.g., a processor) from which the computer is composed.
The term “computer-readable medium” as used herein includes not only a single physical medium or single type of medium, but also a combination of one or more physical media and/or types of media. Examples of a computer-readable medium include, but are not limited to, one or more memories, hard drives, optical discs (such as CDs or DVDs), magnetic discs, and magnetic tape drives.
Such a computer-readable medium may store computer-readable instructions (e.g., software) and/or computer-readable data (i.e., information that may or may not be executable). In the present example, storage 102 may be or include such a computer-readable medium, and may store computer-executable instructions and/or data used by computer 101. While storage 102 is functionally shown in
User input device 103 may be used for receiving user input from a human and providing an indication of the user input to computer 101. Examples of user input device 103 include, but are not limited to, a keyboard, a mouse, a touch-sensitive display or pad, a microphone, and/or a video camera. Likewise, user output device 104 may be used for receiving output from computer 101 and providing an indication of the output in a form that can be sensed by a human. Examples of user output device 104 include, but are not limited to, a display, a printer, and an audio speaker. Whenever user input and user output are described herein, such user input and user output may be provided, respectively, via user input device 103 and user output device 104.
Network 105 may serve to communicatively couple computer 101 with Sources 1, 2, and 3, and may be any type of network or combination of networks. Examples of network 105 include, but are not limited to, the Internet, an intranet, a local-area network (LAN), a landline telephone network, a satellite communication network, and a cellular telephone network or other type of wireless network. In other embodiments, computer 101 may be directly coupled to Sources 1, 2, and/or 3 without intervening network 105. In still further embodiments, data from Sources 1, 2, and/or 3 may be provided to computer 101 and/or to storage 102 in an alternative way, such as by delivery of the stored data on a computer-readable medium.
Sources 1, 2, and 3 may themselves also include a computer and storage. The computer at those sources may further include a web server (where network 105 includes the Internet). Sources 1, 2, and 3 may be used to provide data to be merged by computer 101. Non-limiting examples of Sources 1, 2, and 3 may include Internet Movie Database (IMDB) (www.imdb.com), All Movie Guide (AMG) (www.allmovie.com), and Tribune Media Services (TMS). Thus, in some embodiments, Sources 1, 2, and/or 3 may appear as web pages from the point of view of computer 101. Therefore, computer 101 may also be configured to execute a web browser and/or other software configured to communicate with the web pages generated by Sources 1, 2, and/or 3. In addition, while three sources are shown in this example, any plural number of sources may be used.
In operation, computer 101 may collect multiple data sets from Sources 1, 2, and/or 3, and store these data sets in storage 102. In the following discussions, the data set from Source 1 will be referred to as Data Set 1, the data set from Source 2 will be referred to as Data Set 2, and the data set from Source 3 will be referred to as Data Set 3. The various data sets may or may not be in a similar format. Once the data sets are fully collected (or in parallel with data set collection), computer 101 may merge some or all of these data sets to produce a merged data set. An example of how this merging may occur is described next with reference to
Referring to
The term “television show” as used herein is intended to broadly include any type of entertainment video product that was, is, or may be displayed on a television set. Examples of a television show include, but are not limited to, sitcoms or other television series such as soap operas and other dramatic series, movies (both theatrical and made-for-television movies), documentaries, commercials, news shows and coverage, sports shows, and sports events.
Returning to
This type of normalization may be used for any terms in the data sets. Another example of such a hierarchy (where generic terms may replace more detailed terms) may include replacing “screenwriter” with “writer.” Thus, in one example, it may be desirable to reduce all relational terms between the person and the television show to, for instance, “actor,” “producer,” “director,” and “writer.” As will be seen later, this normalization may make it easier to match or otherwise correspond person/television show relationships between data sets. In alternative embodiments, the data sets themselves may not be modified, and instead the comparison of relationships may take into account the various categories, such matching up, for instance, “screenwriter” with “writer” and “executive producer” with “producer.”
In the present example, it is assumed that each person in Data Sets 1 and 2 has a unique associated identifier (ID). For example, referring to
After normalization, in step 203 computer 101 assigns a new merged ID to each identifier in Data Set 1, which will be used in the merged data set to be created. The merged ID may be determined in any manner desired, such as canonically (e.g., in numerical sequential order such as 0001, 0002, 0003, etc.), randomly, or by parsing data from the person's entry in the source data set. In any event, each merged ID should be unique for that person within the merged data set. So, for example, Adam Apple with an ID of WT56 from Data Set 1 may become, in the new merged data set, Adam Apple with a merged ID of 0001. And, in the new merged data set, there will also be an association between merged ID 0001 and Data Set 1 ID WT56.
Next, in step 204, computer 101 compares Data Sets 1 and 2, in this case by searching for relation correspondences between Data Set 1 and Data Set 2. A relation defines the association between a person's name and a television show involving that person. For example, Data Set 1 shows a relation that Adam Apple is an Actor in Movie 1, and another a relation that Adam Apple is a producer of Sitcom 2. To determine corresponding relations, computer 1 may compare the relations between Data Set 1 and Data Set 2, and then determine whether they correspond to each other. In other words, it is determined whether a relation in Data Set 2 is the same as a relation in Data Set 1. This comparison may look for an exact match in some embodiments. In other embodiments, there may be other features that are used to see if the relations, while not producing an exact textual match, refer to the same association of the same person to the same television show. For instance, in the example of
Returning to
In step 206, mappings of relationships between Data Sets 1 and 2 that are not one-to-one (i.e., those that are one-to-plural or plural-to-one), or are otherwise inconsistent, are flagged in the new merged data set. For example, referring to
In step 207, a new merged ID is then assigned to each ID of Data Set 2 that is not already assigned a new merged ID. In the example of
Next, in step 208, computer 101 adds biographical data for each merged ID, that is available from one or more of the source Data Sets 1 and/or 2. Biographical data may include, for instance, a description of the person's professional achievements and/or a description of the person's characteristics, personality, private life, etc. In some embodiments, the biographical data that is chosen for the merged data set may be taken from that source Data Set that is considered to be more reliable. In other words, Data Set 1 may be considered more reliable than Data Set 2, or vice versa. In further embodiments, the data set from which the biographical data is taken may be made on a case-by-case basis, such as based on the available biographical data itself (e.g., the longer and/or more complete biographical data may be used).
In step 209, those entries in the merged data set that were flagged in step 206 may be manually reviewed and/or modified, since those entries may be more likely to contain errors. Of course, any of the entries may be manually reviewed and/or modified, as desired. However, by flagging suspect entries, this may reduce the number of entries that would in practice be actually manually reviewed.
Accordingly, it may be desirable to handle the merging of such a non-ID data set in a special manner. Also in this example, and as shown in the figures, the result of the process of
In step 501, the data from Data Set 3 is collected, and in step 502 the data from Data Set 3 is normalized, in the same manner as in step 202. Then, in step 503, any relations in Data Set 3 that are already included in the existing merged data set are thrown out. For example, referring again to
Next, step 504 is performed for each relation in Data Set 3 that is not already included in the existing data set (e.g., that is not already included in the merged data set from the process of
If the name in the Data Set 3 relation matches (or otherwise corresponds to) a name in the merged data set, and there is a merged ID associated with that name that is marked as containing non-source-id relations, then situation A is engaged, and step 505 is performed, in which the relation for the name in the Data Set 3 relation is assigned to the existing merged ID. In this particular example, there would not be more than one merged ID for a given name that is marked as containing non-source-ID relations.
Alternatively, if the name in the Data Set 3 relation matches (or otherwise corresponds to) exactly one name in the existing merged data set, then situation B is engaged and so step 505 is performed. That entry is marked in the merged data set as containing a non-source-ID relation.
Alternatively, if the name in the Data Set 3 relation matches (or otherwise corresponds to) multiple names in the merged data set, then situation C is engaged, causing step 506 to be performed, in which a new merged ID is created and associated with the name in Data Set 3 and the relation for that name in Data Set 3 is associated with the new merged ID. Alternatively, if the name in the Data Set 3 relation does not match (or otherwise correspond to) any name in the merged data set, then situation D is engaged, and so also step 506 is performed. In both situations C and D, that new merged ID is marked in the merged data set as containing a non-source-ID relation (e.g., by adding a flag value to that entry).
Also, after performing step 506 in situations C and D, then in step 507 the biographical data is collected from the respective Data Set 3 relation and associated with the respective merged ID.
After all of the new Data Set 3 relations have been processed in steps 505, 506, and/or 507, then in step 508, the merged data set may be made available for manual review and/or modification. It may be desired, for instance, that only those entries flagged as being from non-ID sources are manually reviewed and modified as appropriate. However, any of the entries may be reviewed and/or modified if desired.
Once the merged data set is created using the processes of
Thus, various examples have been provided that allow for the merging of two or more source data sets. A potential result of merging the source data sets is a merged data set that includes a subset of data from each of the source data sets. In particular, where each of the source data sets relates certain persons (or other entities) in roles with regard to certain television shows (or other events), then the merged data set may associate some of the names of the entities from one of the source data sets with some of the roles from another of the source data sets.
While these examples have been in the context of merging data sets relating people with television shows, the techniques described herein may be used in a variety of different data set contexts. For example, these examples may instead have used a different type of entity than a person, such as a corporation name, a sports team name, or the like. Additionally, these examples may instead have used a different type of event than a television show, such as an Internet-provided event (e.g., a movie provided to a viewer over the Internet), a sporting event, play, political debate, whether or not such events are televised. Also, it will be understood that movies in theatres may also be used rather than or in addition to those shown on television. Finally, while certain illustrative roles or relations have been described between the entities (e.g., persons) and events (e.g., television shows), other roles may be used as the content dictates. For example, where the event is a sporting event, then the entity may be a sports player and the role or relation of the sports player to the sporting event may be the position played on the team, or whether that person was a coach or team owner, etc.
Number | Name | Date | Kind |
---|---|---|---|
4227177 | Moshier | Oct 1980 | A |
5493677 | Balogh et al. | Feb 1996 | A |
5521841 | Farshid et al. | May 1996 | A |
5530859 | Tobias, II et al. | Jun 1996 | A |
5535063 | Lamming | Jul 1996 | A |
5553281 | Brown et al. | Sep 1996 | A |
5576755 | Davis et al. | Nov 1996 | A |
5594897 | Goffman | Jan 1997 | A |
5640553 | Schultz | Jun 1997 | A |
5649182 | Reitz | Jul 1997 | A |
5666528 | Thai | Sep 1997 | A |
5682326 | Klingler et al. | Oct 1997 | A |
5717914 | Husick et al. | Feb 1998 | A |
5729741 | Liaguno et al. | Mar 1998 | A |
5737495 | Adams et al. | Apr 1998 | A |
5737734 | Schultz | Apr 1998 | A |
5742816 | Barr et al. | Apr 1998 | A |
5761655 | Hoffman | Jun 1998 | A |
5765150 | Burrows | Jun 1998 | A |
5799315 | Rainey et al. | Aug 1998 | A |
5819292 | Hitz et al. | Oct 1998 | A |
5845279 | Garofalakis et al. | Dec 1998 | A |
5857200 | Togawa | Jan 1999 | A |
5924090 | Krellenstein | Jul 1999 | A |
5928330 | Goetz et al. | Jul 1999 | A |
5937422 | Nelson et al. | Aug 1999 | A |
5956729 | Goetz et al. | Sep 1999 | A |
5982369 | Sciammarella et al. | Nov 1999 | A |
6038560 | Wical | Mar 2000 | A |
6052657 | Yamron et al. | Apr 2000 | A |
6055543 | Christensen et al. | Apr 2000 | A |
6058392 | Sampson et al. | May 2000 | A |
6167377 | Gillick et al. | Dec 2000 | A |
6188976 | Ramaswamy et al. | Feb 2001 | B1 |
6278992 | Curtis et al. | Aug 2001 | B1 |
6320588 | Palmer et al. | Nov 2001 | B1 |
6343294 | Hawley | Jan 2002 | B1 |
6345253 | Viswanathan | Feb 2002 | B1 |
6363380 | Dimitrova | Mar 2002 | B1 |
6366296 | Boreczky et al. | Apr 2002 | B1 |
6374260 | Hoffert et al. | Apr 2002 | B1 |
6415434 | Kind | Jul 2002 | B1 |
6418431 | Mahajan et al. | Jul 2002 | B1 |
6463444 | Jain et al. | Oct 2002 | B1 |
6545209 | Flannery et al. | Apr 2003 | B1 |
6546385 | Mao et al. | Apr 2003 | B1 |
6567980 | Jain et al. | May 2003 | B1 |
6580437 | Liou et al. | Jun 2003 | B1 |
6675174 | Bolle et al. | Jan 2004 | B1 |
6698020 | Zigmond et al. | Feb 2004 | B1 |
6771875 | Kunieda et al. | Aug 2004 | B1 |
6789088 | Lee et al. | Sep 2004 | B1 |
6792426 | Baumeister et al. | Sep 2004 | B2 |
6877134 | Fuller et al. | Apr 2005 | B1 |
6882793 | Fu et al. | Apr 2005 | B1 |
6901364 | Nguyen et al. | May 2005 | B2 |
6937766 | Wilf et al. | Aug 2005 | B1 |
6970639 | McGrath et al. | Nov 2005 | B1 |
7155392 | Schmid et al. | Dec 2006 | B2 |
7177861 | Tovinkere et al. | Feb 2007 | B2 |
7206303 | Karas et al. | Apr 2007 | B2 |
7272558 | Soucy et al. | Sep 2007 | B1 |
7376642 | Nayak et al. | May 2008 | B2 |
7472137 | Edelstein et al. | Dec 2008 | B2 |
7490092 | Sibley et al. | Feb 2009 | B2 |
7548934 | Platt et al. | Jun 2009 | B1 |
7584102 | Hwang et al. | Sep 2009 | B2 |
7596549 | Issa et al. | Sep 2009 | B1 |
7739286 | Sethy et al. | Jun 2010 | B2 |
7788266 | Venkataraman et al. | Aug 2010 | B2 |
7792812 | Carr | Sep 2010 | B1 |
7814267 | Iyengar et al. | Oct 2010 | B1 |
7921116 | Finkelstein et al. | Apr 2011 | B2 |
7925506 | Farmaner et al. | Apr 2011 | B2 |
7958119 | Eggink et al. | Jun 2011 | B2 |
7983902 | Wu et al. | Jul 2011 | B2 |
8041566 | Peters et al. | Oct 2011 | B2 |
8078467 | Wu et al. | Dec 2011 | B2 |
8117206 | Sibley et al. | Feb 2012 | B2 |
8265933 | Bates et al. | Sep 2012 | B2 |
8468083 | Szulczewski | Jun 2013 | B1 |
8527520 | Morton et al. | Sep 2013 | B2 |
8572087 | Yagnik | Oct 2013 | B1 |
8909655 | McDonnell | Dec 2014 | B1 |
20010014891 | Hoffert et al. | Aug 2001 | A1 |
20020035573 | Black et al. | Mar 2002 | A1 |
20020087315 | Lee et al. | Jul 2002 | A1 |
20020091837 | Baumeister et al. | Jul 2002 | A1 |
20020143774 | Vandersluis | Oct 2002 | A1 |
20020194181 | Wachtel | Dec 2002 | A1 |
20030014758 | Kim | Jan 2003 | A1 |
20030033297 | Ogawa | Feb 2003 | A1 |
20030050778 | Nguyen et al. | Mar 2003 | A1 |
20030061028 | Dey et al. | Mar 2003 | A1 |
20030093790 | Logan et al. | May 2003 | A1 |
20030135582 | Allen et al. | Jul 2003 | A1 |
20030163443 | Wang | Aug 2003 | A1 |
20030163815 | Begeja et al. | Aug 2003 | A1 |
20030195877 | Ford et al. | Oct 2003 | A1 |
20030204513 | Bumbulis | Oct 2003 | A1 |
20040111465 | Chuang et al. | Jun 2004 | A1 |
20040117831 | Ellis et al. | Jun 2004 | A1 |
20040139091 | Shin | Jul 2004 | A1 |
20040215634 | Wakefield et al. | Oct 2004 | A1 |
20040225667 | Hu et al. | Nov 2004 | A1 |
20040243539 | Skurtovich et al. | Dec 2004 | A1 |
20040254795 | Fujii et al. | Dec 2004 | A1 |
20040267700 | Dumais et al. | Dec 2004 | A1 |
20050044105 | Terrell | Feb 2005 | A1 |
20050060647 | Doan et al. | Mar 2005 | A1 |
20050091443 | Hershkovich et al. | Apr 2005 | A1 |
20050097138 | Kaiser et al. | May 2005 | A1 |
20050114130 | Java et al. | May 2005 | A1 |
20050124320 | Ernst | Jun 2005 | A1 |
20050152362 | Wu | Jul 2005 | A1 |
20050193005 | Gates et al. | Sep 2005 | A1 |
20050222975 | Nayak et al. | Oct 2005 | A1 |
20060004738 | Blackwell | Jan 2006 | A1 |
20060037046 | Simms et al. | Feb 2006 | A1 |
20060074671 | Farmaner et al. | Apr 2006 | A1 |
20060085406 | Evans | Apr 2006 | A1 |
20060088276 | Cho | Apr 2006 | A1 |
20060100898 | Pearce et al. | May 2006 | A1 |
20060112097 | Callaghan et al. | May 2006 | A1 |
20060156399 | Parmar et al. | Jul 2006 | A1 |
20060161546 | Callaghan et al. | Jul 2006 | A1 |
20060167859 | Verbeck Sibley et al. | Jul 2006 | A1 |
20060184495 | Crosby et al. | Aug 2006 | A1 |
20060212288 | Sethy et al. | Sep 2006 | A1 |
20060235843 | Musgrove et al. | Oct 2006 | A1 |
20060253780 | Munetsugu et al. | Nov 2006 | A1 |
20060256739 | Seier et al. | Nov 2006 | A1 |
20070011133 | Chang | Jan 2007 | A1 |
20070050343 | Siddaramappa et al. | Mar 2007 | A1 |
20070050366 | Bugir et al. | Mar 2007 | A1 |
20070067285 | Blume et al. | Mar 2007 | A1 |
20070078708 | Yu et al. | Apr 2007 | A1 |
20070083374 | Bates et al. | Apr 2007 | A1 |
20070156677 | Szabo | Jul 2007 | A1 |
20070208567 | Amento et al. | Sep 2007 | A1 |
20070211762 | Song et al. | Sep 2007 | A1 |
20070214123 | Messer et al. | Sep 2007 | A1 |
20070214488 | Nguyen et al. | Sep 2007 | A1 |
20070233487 | Cohen et al. | Oct 2007 | A1 |
20070233656 | Bunescu et al. | Oct 2007 | A1 |
20070233671 | Oztekin et al. | Oct 2007 | A1 |
20070239707 | Collins et al. | Oct 2007 | A1 |
20070250901 | McIntire et al. | Oct 2007 | A1 |
20070260700 | Messer | Nov 2007 | A1 |
20070271086 | Peters et al. | Nov 2007 | A1 |
20080033915 | Chen et al. | Feb 2008 | A1 |
20080046929 | Cho et al. | Feb 2008 | A1 |
20080059418 | Bareness et al. | Mar 2008 | A1 |
20080091633 | Rappaport et al. | Apr 2008 | A1 |
20080118153 | Wu et al. | May 2008 | A1 |
20080133504 | Messer et al. | Jun 2008 | A1 |
20080147650 | Marsh | Jun 2008 | A1 |
20080162533 | Mount et al. | Jul 2008 | A1 |
20080163328 | Philbin et al. | Jul 2008 | A1 |
20080168045 | Suponau et al. | Jul 2008 | A1 |
20080183681 | Messer et al. | Jul 2008 | A1 |
20080183698 | Messer et al. | Jul 2008 | A1 |
20080189110 | Freeman et al. | Aug 2008 | A1 |
20080204595 | Rathod et al. | Aug 2008 | A1 |
20080208796 | Messer et al. | Aug 2008 | A1 |
20080208839 | Sheshagiri et al. | Aug 2008 | A1 |
20080208864 | Cucerzan et al. | Aug 2008 | A1 |
20080221989 | Messer et al. | Sep 2008 | A1 |
20080222105 | Matheny | Sep 2008 | A1 |
20080222106 | Rao et al. | Sep 2008 | A1 |
20080222142 | O'Donnell | Sep 2008 | A1 |
20080235209 | Rathod et al. | Sep 2008 | A1 |
20080235393 | Kunjithapatham et al. | Sep 2008 | A1 |
20080250010 | Rathod et al. | Oct 2008 | A1 |
20080256097 | Messer et al. | Oct 2008 | A1 |
20080266449 | Rathod et al. | Oct 2008 | A1 |
20080281801 | Larson et al. | Nov 2008 | A1 |
20080288641 | Messer et al. | Nov 2008 | A1 |
20080319962 | Riezler et al. | Dec 2008 | A1 |
20090006315 | Mukherjea et al. | Jan 2009 | A1 |
20090006391 | Ram | Jan 2009 | A1 |
20090013002 | Eggink et al. | Jan 2009 | A1 |
20090025054 | Gibbs et al. | Jan 2009 | A1 |
20090055381 | Wu et al. | Feb 2009 | A1 |
20090077078 | Uppala | Mar 2009 | A1 |
20090083257 | Bargeron et al. | Mar 2009 | A1 |
20090094113 | Berry et al. | Apr 2009 | A1 |
20090123021 | Jung et al. | May 2009 | A1 |
20090131028 | Horodezky | May 2009 | A1 |
20090144260 | Bennett et al. | Jun 2009 | A1 |
20090144609 | Liang et al. | Jun 2009 | A1 |
20090157680 | Crossley et al. | Jun 2009 | A1 |
20090172544 | Tsui et al. | Jul 2009 | A1 |
20090198686 | Cushman, II et al. | Aug 2009 | A1 |
20090204599 | Morris et al. | Aug 2009 | A1 |
20090205018 | Ferraiolo et al. | Aug 2009 | A1 |
20090240650 | Wang et al. | Sep 2009 | A1 |
20090240674 | Wilde et al. | Sep 2009 | A1 |
20090271195 | Kitade et al. | Oct 2009 | A1 |
20090279682 | Strandell | Nov 2009 | A1 |
20090282069 | Callaghan et al. | Nov 2009 | A1 |
20090326947 | Arnold et al. | Dec 2009 | A1 |
20100042602 | Smyros et al. | Feb 2010 | A1 |
20100063886 | Stratton | Mar 2010 | A1 |
20100070507 | Mori | Mar 2010 | A1 |
20100094845 | Moon et al. | Apr 2010 | A1 |
20100138653 | Spencer et al. | Jun 2010 | A1 |
20100250598 | Brauer et al. | Sep 2010 | A1 |
20110004462 | Houghton et al. | Jan 2011 | A1 |
20110016106 | Xia | Jan 2011 | A1 |
20110077943 | Miki et al. | Mar 2011 | A1 |
20110125728 | Smyros et al. | May 2011 | A1 |
20110191099 | Farmaner et al. | Aug 2011 | A1 |
20110246503 | Bender et al. | Oct 2011 | A1 |
20120036119 | Zwicky et al. | Feb 2012 | A1 |
20120078932 | Skurtovich, Jr. et al. | Mar 2012 | A1 |
20120150636 | Freeman et al. | Jun 2012 | A1 |
20120191695 | Xia | Jul 2012 | A1 |
20120203708 | Psota | Aug 2012 | A1 |
20130054589 | Cheslow | Feb 2013 | A1 |
20130216207 | Berry | Aug 2013 | A1 |
Number | Date | Country |
---|---|---|
2685833 | May 2010 | CA |
1241587 | Sep 2002 | EP |
1462950 | Sep 2004 | EP |
1501305 | Jan 2005 | EP |
244875 | Dec 1925 | GB |
2448874 | Nov 2008 | GB |
9950830 | Oct 1999 | WO |
0205135 | Jan 2002 | WO |
2005050621 | Jun 2005 | WO |
2006099621 | Sep 2006 | WO |
2007115224 | Oct 2007 | WO |
2008053132 | May 2008 | WO |
2009052277 | Apr 2009 | WO |
2010100853 | Sep 2010 | WO |
Entry |
---|
International Search Report and Written Opinion for PCT/US09/69644, dated Mar. 4, 2010. |
Messer, Alan et al., “SeeNSearch: A Context Directed Search Facilitator for Home Entertainment Devices”, Paper, Feb. 9, 2008, Samsung Information Systems America Inc., San Jose, CA. |
Kontothoanassis, Ledonias et al. “Design, Implementation, and Analysis of a Multimedia Indexing and Delivery Server”, Technical Report Series, Aug. 1999, Cambridge Research Laboratory. |
Smith, J.R. et al. “An Image and Video Search Engine for the World-Wide Web” Storage and Retrieval for Image and Video Databases 5, San Jose, Feb. 13-14, 1997, Proceedings of Spie, Belingham, Spie, US, vol. 3022, Feb. 13, 1997, pp. 84-95. |
IPER PCT/US2009/069644—Jun. 29, 2011. |
ISR PCT/US2009/069644—Mar. 4, 2010. |
ESR—EP10154725.5—Nov. 2, 2010. |
ESR—EP10155340.2—Nov. 25, 2010. |
Partial ESR—EP10155340.2—Jul. 12, 2010. |
ESR—EP10162666.1—Aug. 4, 2011. |
ESR—EP10167947.0—Sep. 28, 2010. |
Shahraray: “Impact and Applications of Video Content Analysis and Coding in the internet and Telecommunications”, AT&T Labs Research, A Position Statement for Panel 4: Applications the 1998 International Workshop on Very Low Bitrate Video Coding, 3 pages. |
Kalina Bontcheva et al “Shallow Methods for Named Entity Coreference Resolution”, Proc. of Tain 2002, Jan. 1, 2002. |
Raphael Volz et al., “Towards ontologybased disambiguation of geographical identifiers”, Proceedings of the WWW2007 Workship I3: Identity, Identifiers, Identification, Entity-Centric Approaches to Information and Knowledge Management on the Web, Jan. 1, 2007. |
Wacholder N et al., “Disambiguation of Proper Names in Text”, Proceedings of the Conference on Applied Natural Language Processing, Association Computer Linguistics, Morrisontown, NJ, Mar. 1, 2007. |
Boulgouris N. V. et al., “Real-Time Compressed-Domain Spatiotemporal Segmentation and Ontologies for Video Indexing and Retrieval”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 14, No. 5, pp. 606-621, May 2004. |
Changsheng Xu et al., “Using Webcast Text for Semantic Event Detection in Broadcast Sports Video”, IEEE Transactions on Multimedia, vol. 10, No. 7, pp. 1342-1355, Nov. 2008. |
Liang Bai et al., “Video Semantic Content Analysis based on Ontology”, International Machine Vision and Image Processing Conference, pp. 117-124, Sep. 2007. |
Koskela M. et al., “Measuring Concept Similarities in Multimedia Ontologies: Analysis and Evaluations”, IEEE Transactions on Multimedia, vol. 9, No. 5, pp. 912-922, Aug. 2007. |
Steffen Staab et al., “Semantic Multimedia”, Reasoning Web; Lecture Notes in Computer Science, pp. 125-170, Sep. 2008. |
European Search Report EP09179987.4, dated Jun. 4, 2010. |
Li, Y. et al., “Reliable Video Clock Time Recognition,” Pattern Recognition, 2006, 1CPR 1006, 18th International Conference on Pattern Recognition, 4 pages. |
Salton et al., Computer Evaluation of Indexing and Text Processing Journal of the Association for Computing Machinery, vol. 15, No. 1, Jan. 1968, pp. 8-36. |
European Search Report for Application No. 09180776.8, dated Jun. 7, 2010, 9 pages. |
European Search Report EP 09180762, dated Mar. 22, 2010. |
European Application No. 09175979.5—Office Action dated Mar. 15, 2010. |
EP Application No. 09 175 979.5—Office Action dated Apr. 11, 2011. |
European Patent Application No. 09175979.5—Office Action dated Dec. 13, 2011. |
International Preliminary Examination Report for PCT/US01/20894, dated Feb. 4, 2002. |
Towards a Multimedia World-Wide Web Information retrieval engines, Sougata Mukherjea, Kyoji Hirata, and Yoshinori Hara Computer Networks and ISDN Systems 29 (1997) 1181-1191. |
Experiments in Spoken Document Retrieval at CMU, M.A. Siegler, M.J. Wittbrock, S.T. Slattery, K. Seymore, R.E. Jones, and A.G. Hauptmann, School of Computer Science Carnegie Mellon University, Pittsburgh, PA 15213-3890, Justsystem Pittsburgh Research Center, 4616 Henry Street, Pittsburgh, PA 15213. |
Eberman, et al., “Indexing Multimedia for the Internet”, Compaq, Cambridge Research laboratory, Mar. 1999, pp. 1-8 and Abstract. |
Ishitani, et al., “Logical Structure Analysis of Document Images Based on Emergent Computation”, IEEE Publication, pp. 189-192, Jul. 1999. |
First Office Action in EP01950739.1-1244 dated Mar. 27, 2009. |
Chen, “Extraction of Indicative Summary Sentences from Imaged Documents”, IEEE publication, 1997, pp. 227-232. |
Hsin-Min Wang and Berlin Chen, “Content-based Language Models for Spoken Document Retrieval”, ACM, 2000, pp. 149-155. |
Marin, Feldman, Ostendorf and Gupta, “Filtering Web Text to Match Target Genres”, International Conference on Acoustics, Speech and Signal Processing, 2009, Piscataway, NJ, Apr. 19, 2009, pp. 3705-3708. |
European Search Report for application No. 10167947.0, dated Sep. 28, 2010. |
“Ying Zhang and Phil Vines. 2004. Using the web for automated translation extraction in cross-language information retrieval. In Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '04). ACM, New York, NY, USA, 162-169”. |
Extended European Search Report—EP 09815446.1—dated May 7, 2013. |
Canadian Patent Application No. 2,685,833—Office Action dated Jan. 20, 2012. |
European Office Action—EP 10154725.5—dated Apr. 24, 2015. |
Response to European Office Action—EP Appl. 9180762.8—Submitted Jul. 29, 2015. |
European Office Action—EP Appl. 10162666.1—dated Jul. 10, 2015. |
Chen, Langzhou, et al. “Using information retrieval methods for language model adaptation.” Interspeech. 2001. |
Sethy, Abhinav, Panayiotis G. Georgiou, and Shrikanth Narayanan. “Building topic specific language models from webdata using competitive models.” Interspeech. 2005. |
Behrang Mohit and Rebecca Hwa, 2005. Syntax-based Semi-Supervised Named Entity Tagging. In Proceedings of the ACL Interactive Poster and Demonstration Sessions, pp. 57-60. |
Shumeet Baluja, Vibhu Mittal and Rahul Sukthankar, 1999. Applying machine learning for high performance named-entity extraction. In Proceedings of Pacific Association for Computational Linguistics. |
R. Bunescu and M. Pasca. 2006. Using encyclopedic knowledge for named entity disambiguation. In Proceedings of EACL—2006, pp. 9-16. |
S. Cucerzan. 2007. Large-Scale Named Entity Disambiguation Based on Wikipedia Data. In Proceedings of EMNLP-CoNLL 2007, pp. 708-716. |
Radu Florian, 2002. Named entity recognition as a house of cards: Classifier stacking. In Proceedings of CoNL2002, pp. 175-178. |
Martin Jansche, 2002. Named Entity Extraction with Conditional Markov Models and Classifiers. In Proceedings of CoNLL-2002. |
Thamar Solorio, 2004. Improvement of Named Entity Tagging by Machine Learning. Reporte Tecnico No. CCC-04-004. INAOE. |
Canadian Office Action—CA Application 2,697,565—dated Dec. 15, 2015. |
Response to European Office Action—EP 10162666.1—dated Oct. 14, 2015. |
Response to European Office Action—EP Appl. 10154725.5—submitted Oct. 14, 2015. |
Canadian Office Action—CA Appl. 2,694,943—dated Jun. 1, 2016. |
European Office Action—EP Appl. 09815446.1—dated Feb. 17, 2016. |
Canadian Office Action—CA Appl. 2,703,569—dated Apr. 19, 2016. |
Canadian Office Action—CA Appl. 2,708,842—dated May 9, 2016. |
Canadian Office Action—CA Appl. 2,688,921—dated Feb. 16, 2016. |
Canadian Office Action—Ca App 2,695,709—dated Jun. 20, 2016. |
Canadian Office Action—CA Appl. 2,689,376—dated Feb. 23, 2016. |
Canadian Office Action—CA Appl. 2,708,842—dated Apr. 12, 2017. |
Arthur De Vany, W. David Walls, “Uncertainty in the Movie Industry: Does Star Power Reduce the Terror of the Box Office?,” Journal of Cultural Economics, 1999, pp. 285-318, Issue 23, Kluwer Academic Publishers, Netherlands. |
Oct. 6, 2017—European Decision to Refuse—EP 09180762.8. |
Oct. 25, 2017—European Decision to Refuse—EP 09815446.1. |
Mar. 21, 2017—Canadian Office Action—CA App. 2,694,943. |
Canadian Office Action—CA Appl. 2,703,569—dated Feb. 8, 2017. |
Canadian Office Action—CA App 2,697,565—dated Dec. 28, 2016. |
Nov. 28, 2017—European Decision to Refuse—EP 10162666.1. |
Dec. 15, 2017—Canadian Office Action—CA 2689376. |
Feb. 2, 2018—Canadian Office Action—CA 2,708,842. |
Feb. 15, 2018—Canadian Office Action—CA 2,697,565. |
Mar. 21, 2018—Canadian Office Action—CA 2,694,943. |
Feb. 28, 2018—Canadian Office Action—2,703,569. |
Dec. 17, 2018—Canadian Office Action—CA 2,708,842. |
Mar. 28, 2019—Canadian Office Action—CA 2,703,569. |
Nov. 15, 2019—Canadian Office Action—CA 2,708,842. |
Apr. 29, 2021—Canadian Office Action—CA 2,703,569. |
May 27, 2022—CA Office Action—CA App. No. 2,703,569. |
Number | Date | Country | |
---|---|---|---|
20100169385 A1 | Jul 2010 | US |