THE SEGMENTS ARE UTTERANCES AREN'T THEY YEAH YEAH THAT'S UM LIKE THEY ARE THEY ARE A SUPER UNIT SO SO THE UTTERANCES ARE TIED TO TOPIC SEGMENTS AND IF THE TIME STAMPS ARE ON A WORD LEVEL THEN WE B SOMEHOW HAVE TO EXTRACT TIME STAMPS FOR UTTERANCES WHERE THEY START WELL THAT'S EASY SEGMENTS UM AND FOR TH UM SEGMENTS IS FOR EXAMPLE WHEN WHEN YOU LOOK AT THE DATA WHAT IS DISPLAYED IN ONE LINE OKAY IS THE UH IS THAT THE SAME AS UTTERANCES THAT IS THAT THE SAME AS UTTERANCES THAT WELL IT'S CLOSE ENOUGH ISN'T IT IT MAY NOT BE EXACT EVERY TIME BUT IT'S A SO SORT OF SIZE WE'RE LOOKING FOR MM-HMM MM-HMM UM AND BASICALLY IT'S UH WORDS THAT ARE UTTERED IN A SEQUENCE WITHOUT PAUSES BUT SOMETIMES UM HOWEVER THERE ARE UM SHORT PAUSES IN IT AND THEY'RE INDICATED BY SQUARE BRACKETS PAUSE OR SOMETHING IN THE DATA UM SOMETI UH BUT UH THE ANNOTATORS DECIDED WHAT WAS ONE SEGMENT AND WHAT WASN'T OKAY OKAY SO BUT BUT GENERALLY UTTERANCES IS THAT WHICH WE JUST CALLED UH SORRY SEGMENTS IS THAT WHICH WE JUST CALLED UTTERANCES NOW LIKE IT'S IT'S THE SA IT'S SORT OF LIKE ONE PERSON'S CONTRIBUTION AT A TIME SORT OF THINGY DINGY OKAY OKAY SO YEAH SO WE HAVE THOSE AND AND THEN WE HAVE SOME F FIELD SOMEWHERE ELSE WHICH HAS TOPICS TOPICS YEAH YEAH AND AND A TOPIC'S BASICALLY THEY ARE JUST ON THE I. D. PROBABLY WITH A START TIME OR SOMETHING AND AND THE UTTERANCES REFERENCED TO THOSE TOPICS I GUESS SO THE TOPICS DON'T CONTAIN ANY REDUNDANT THING OF LIKE SHOWING THE WHOLE TOPIC AGAIN BUT THEY JUST SORT OF SAY A NUMBER AND WHERE THEY START AND WHERE THEY FINISH AND THE UTTERANCES THEN SAY WHICH TOPIC THEY BELONG TO HMM FOR EXAMPLE FOR THE DIALOGUE ACTS AND SO ON YEAH NO BUT I WAS THINKING OF THE TOPIC SEGMENTATION NOW AND AND F FOR THAT THERE WOULD ONLY BE ONE RIGHT BECAUSE IT'S SORT OF LIKE IT'S JUST A TIME WINDOW MM-HMM YEAH SO IF THIS LAZY LOADING WORKS THEN THIS SHOULD DEFINITELY FIT INTO I MEAN NOT MEMORY THEN BECAUSE IT WOULDN'T ALL BE IN MEMORY AT THE SAME TIME SO IF WE JUST HAVE THOSE SORT OF THAT INFORMATION LIKE A LONG LIST OF ALL THE UTTERANCES SLASH SEGMENTS AND LIKE SHORT OR SMALLER LISTS WHICH GIVE WEIGHT TO THEM AND EVEN THOUGH PROBABLY IF THERE'S A LOT OF OVER HEAD IN HAVING TWO DIFFERENT FILES WE CAN PROBABLY MERGE THE WEIGHTS INTO IT OFF LINE YOU KNOW WHAT I MEAN LIKE IF IF THERE'S A LOT OF BUREAUCRACY INVOLVED WITH HAVING TWO DIFFERENT TREES AND WHETHER ONE TIES TO THE OTHER BECAUSE THE ONE HAS THE WEIGHT FOR THE OTHER THEN IT'S PROBABLY QUICKER TO JUST BUT WHY DON'T WE JUST WRITE IT AS A NEW X. M. L. FILE CAN NITE HANDLE JUST LOADING ARBITRARY UH NEW LIKE ATTRIBUTES AND STUFF I MEAN I WOULD HAVE THOUGHT THEY'D MAKE IT ABLE TO YEAH I THOUGHT THAT WAS THE WHOLE BEAUTY THAT LIKE YOU CAN JUST MAKE A NEW X. M. L. FILE AND SORT OF TIE THAT TO THE OTHER AND AND IT TRE OH YEAH SO NO I DIDN'T I DIDN'T MEAN TREE NO NO I MEANT JUST LIKE HANDLING TWO DIFFERENT FILES INTERNALLY SORT OF C I WAS JUST THINKING YOU KNOW LIKE IF IF THE OVERHEAD FOR HAVING THE SAME AMOUNT OF DATA COMING FROM TWO D FILES INSTEAD OF FROM ONE FILE IS MASSIVE THEN IT WOULD PROBABLY BE FOR US EASY TO JUST LIKE OFF LINE PUT THE THE WEIGHT INTO INTO THE FILE THAT HAS THE SEGMENTS UH YEAH SEGMENTS SLASH UTTERANCES ALREADY BUT THAT WE CAN FIGURE OUT I MEAN IF IT'S GOING HORRENDOUSLY WRONG YEAH YEAH YEAH NO WE'D WE'D BE COMPLETELY USING LIKE THE WHOLE INFRASTRUCTURE AND BASICALLY JUST I MEAN THE MAIN DIFFERENCE REALLY BETWEEN OUR PROJECT AND THEIRS REALLY IS THAT WE LOAD A DIFFERENT PART OF THE DATA BUT OTHERWISE WE'RE DOING IT THE SAME WAY THAT THEY ARE DOING IT SO WE JUST WE'RE SORT OF RUNNING DIFFERENT TYPES OF QUERIES ON IT WE IN A SENSE WE I THINK WE ARE RUNNING QUERIES IT'S NOT JUST ABOUT UM WHAT WE LOAD AND WHAT WE DON'T LOAD BUT WE'RE L RUNNING QUERIES IN THE SENSE THAT WE DYNAMICALLY SELECT BY BY WEIGHTS DON'T WE THAT WE HAVE TO CHECK HOW FAST THAT IS LIKE TO SAY GIVE US ALL THE ONES THAT WHETHER THAT WORKS WITH THEIR QUERY LANGUAGE WHETHER THAT'S TOO MANY RESULTS AND WHETHER WE SHOU YOU KNOW IF 'CAUSE IF IT I LET'S SAY I MEAN IF IF THEIR QUERY LANGUAGE IS STRANGE AND IF IT WOULD RETURN B TEN MILLION RESULTS AND IT CAN'T HANDLE IT THEN WE CAN JUST WRITE OUR INDIVIDUAL COMPONENTS IN THE WAY THAT THEY KNOW WHICH WHAT THE THRESHOLD IS SO THEY STILL GET ALL THE DATA AND JUST THEY INTERNALLY SAY OH NO THIS IS LESS THAN THREE AND I'M NOT GONNA DISPLAY IT OR SOMETHING YEAH I MEAN WE CAN PROCESS IT IN CHUNKS IF IT GETS TOO BIG BASICALLY WE CAN JUST PROCESS IT ALL IN CHUNKS IF IT GETS TOO BIG TO LOAD IT INTO MEMORY I'M JUST THINKING FOR THIS WHOLE THING OF LIKE A DIFFERENT LEVEL SORT OF CUTTING OUT DIFFERENT DIFFERENT PIECES WHETHER WE DO THAT THROUGH A QUERY WHERE WE SAY GIVE US EVERYTHING THAT'S AB ABOVE THIS AND THIS WEIGHT OR WHETHER WE SKIP THE SAME INFRASTRUCTURE BUT EVERY INDIVIDUAL MODULE LIKE THE PLAYER AND THE DISPLAY SAY LIKE THEY STILL GET SORT OF ALL THE DIFFERENT UTTERANCES UH ALL THE DIFFERENT PIECES BUT THEY SAY OH THIS PIECE I LEAVE OUT BECAUSE IT'S BELOW THE CURRENT THRESHOLD LEVEL I THINK WE PROBABLY WANT TO STORE UM A HIERARCHICAL INFORMATION DENSITY AS WELL SO LIKE AN INFORMAN MATION DENSITY SCORE FOR EACH MEETING AND EACH TOPIC SEGMENT 'CAUSE OTHERWISE WE'D BE RECALCULATING THE SAME THING OVER AND OVER AND OVER AGAIN YEAH THAT'D BE MUCH MORE EFFICIENT TO DO THAT YEAH AND THAT WILL OBVIOUSLY MAKE IT MUCH EASIER TO DISPLAY WHEN DO WE NEED THE ONE FOR THE MEET WELL IT MAY NOT FOR THE WHOLE MEETING BUT LIKE YEAH I GUESS FOR THE SO WHEN WE HAVE THE DISPLAY WILL WE DISPLAY THE WHOLE SERIES THEN IF WE HAVE FOR THE INDIVIDUAL TOPIC SEGMENTS WITHIN THE MEETINGS IF WE HAVE READY CALCULATED DISP UM MEASURES THEN WE DON'T HAVE TO SORT OF EXTRACT THAT DATA FROM THE INDIVIDUAL UTTERANCES YEAH AND THAT'S ALSO FAIRLY EASY TO STORE ALONG WITH OUR SEGMENTS ISN'T IT FOR THE SEGMENTS ARE WE EXTRACTING SOME TYPE OF TITLE FOR THEM THAT WE CRAFT WITH SOME FANCY ALGORITHM OR MANUALLY OR WE'RE JUST TAKING THE SINGLE MOST HIGHLY VALUED KEY WORD UTTERANCE FOR THE SEGMENT HEADING LIKE THAT WELL I WAS GONNA START OFF I'VE V GOT SORT OF HALF WAY THROUGH IMPLEMENTING ONE THAT DOES JUST I. D. F. HMM